In nite Block - Structured Transition
نویسندگان
چکیده
In this paper, we study Markov chains with in nite state block-structured transition matrices, whose states are partitioned into levels according to the block structure, and various associated measures. Roughly speaking, these measures involve rst passage times or expected numbers of visits to certain levels without hitting other levels; they are very important and often play a key role in the study of a Markov chain. Necessary and/or su cient conditions are obtained for a Markov chain to be positive recurrent, recurrent, or transient in terms of these measures. Results are obtained for general irreducible Markov chains as well as those with transition matrices possessing some block structure. We also discuss the decomposition or the factorization of the characteristic equations of these measures. In the scalar case, we locate the zeros of these characteristic functions and therefore use these zeros to characterize a Markov chain. Examples and various remarks are given to illustrate some of the results.
منابع مشابه
Translations between Textual Transition Systems and Petri Nets
Translations between models expressed in textual transition systems and those ex pressed in structured Petri net notation are presented in both directions The transla tions are structure preserving meaning that the hierarchical structure of the systems is preserved Furthermore assuming non nite state data manipulation has been abstracted out of the textual transition system then translating one...
متن کاملGeneral Decidability Theorems for Infinite-State Systems
Over the last few years there has been an increasing research eeort directed towards the automatic veriication of innnite state systems. For diierent classes of such systems (e.g., hybrid automata, data-independent systems, relational automata, Petri nets, and lossy channel systems) this research has resulted in numerous highly nontrivial algorithms. As the interest in this area increases, it w...
متن کاملDuality Results for Block - Structured TransitionMatricesYiqiang
In this paper, we consider a certain class of Markov renewal processes where the matrix of the transition kernel governing the Markov renewal process possesses some block-structured property, including repeating rows. Duality conditions and properties are obtained on two probabilistic measures which often play a key role in the analysis and computations of such a block-structured process. The m...
متن کاملStrategies for Parallel and Numerical Scalability of CFD Codes
In this article we discuss a strategy for speeding up the solution of the NavierStokes equations on highly complex solution domains such as complete aircraft, spacecraft, or turbomachinery equipment. We have used a nite-volume code for the (non-turbulent) Navier-Stokes equations as a testbed for implementation of linked numerical and parallel processing techniques. Speedup is achieved by the Ta...
متن کاملA rst-order block-decomposition method for solving two-easy-block structured semide nite programs
In this paper, we consider a rst-order block-decomposition method for minimizing the sum of a convex di erentiable function with Lipschitz continuous gradient, and two other proper closed convex (possibly, nonsmooth) functions with easily computable resolvents. The method presented contains two important ingredients from a computational point of view, namely: an adaptive choice of stepsize for ...
متن کامل